Goto

Collaborating Authors

 princeton university princeton





Kissing to Find a Match: Efficient Low-Rank Permutation Representation - Supplementary Material

Neural Information Processing Systems

Following our shape-matching experiments described in Sec. The recorded time values align with the accuracy measurements presented in Figure 1b. Moreover, it's possibly also necessary to adapt a network architecture that predicts the



Redefining Research Crowdsourcing: Incorporating Human Feedback with LLM-Powered Digital Twins

Chan, Amanda, Di, Catherine, Rupertus, Joseph, Smith, Gary, Rao, Varun Nagaraj, Ribeiro, Manoel Horta, Monroy-Hernández, Andrés

arXiv.org Artificial Intelligence

Crowd work platforms like Amazon Mechanical Turk and Prolific are vital for research, yet workers' growing use of generative AI tools poses challenges. Researchers face compromised data validity as AI responses replace authentic human behavior, while workers risk diminished roles as AI automates tasks. To address this, we propose a hybrid framework using digital twins, personalized AI models that emulate workers' behaviors and preferences while keeping humans in the loop. We evaluate our system with an experiment (n=88 crowd workers) and in-depth interviews with crowd workers (n=5) and social science researchers (n=4). Our results suggest that digital twins may enhance productivity and reduce decision fatigue while maintaining response quality. Both researchers and workers emphasized the importance of transparency, ethical data use, and worker agency. By automating repetitive tasks and preserving human engagement for nuanced ones, digital twins may help balance scalability with authenticity.


A Theory of Decision Making Under Dynamic Context

Shvartsman, Michael, Srivastava, Vaibhav, Cohen, Jonathan D.

Neural Information Processing Systems

The dynamics of simple decisions are well understood and modeled as a class of random walk models (e.g. Laming, 1968; Ratcliff, 1978; Busemeyer and Townsend, 1993; Usher and McClelland, 2001; Bogacz et al., 2006). However, most real-life decisions include a rich and dynamically-changing influence of additional information we call context. In this work, we describe a computational theory of decision making under dynamically shifting context. We show how the model generalizes the dominant existing model of fixed-context decision making (Ratcliff, 1978) and can be built up from a weighted combination of fixed-context decisions evolving simultaneously. We also show how the model generalizes re- cent work on the control of attention in the Flanker task (Yu et al., 2009). Finally, we show how the model recovers qualitative data patterns in another task of longstanding psychological interest, the AX Continuous Performance Test (Servan-Schreiber et al., 1996), using the same model parameters.


Convergence and Consistency of Regularized Boosting Algorithms with Stationary B-Mixing Observations

Lozano, Aurelie C., Kulkarni, Sanjeev R., Schapire, Robert E.

Neural Information Processing Systems

We study the statistical convergence and consistency of regularized Boosting methods, where the samples are not independent and identically distributed(i.i.d.) but come from empirical processes of stationary β-mixing sequences. Utilizing a technique that constructs a sequence of independent blocks close in distribution to the original samples, we prove the consistency of the composite classifiers resulting from a regularization achievedby restricting the 1-norm of the base classifiers' weights. When compared to the i.i.d.